FGb: A Library for Computing Gröbner Bases
نویسنده
چکیده
FGb is a high-performance, portable, C library for computing Gröbner bases over the integers and over finite fields. FGb provides high quality implementations of state-of-the-art algorithms (F4 and F5) for computing Gröbner bases. Currently, it is one of the best implementation of these algorithms, in terms of both speed and robustness. For instance, FGb has been used to break several cryptosystems.
منابع مشابه
Groebner Bases for Everyone with CoCoA-5 and CoCoALib
We present a survey on the developments related to Gröbner bases, and show explicit examples in CoCoA. The CoCoA project dates back to 1987: its aim was to create a “mathematician”-friendly computational laboratory for studying Commutative Algebra, most especially Gröbner bases. Always maintaining this “friendly” tradition, the project has grown and evolved, and the software has been completely...
متن کاملReduced Gröbner Bases in Polynomial Rings over a Polynomial Ring
We define reduced Gröbner bases in polynomial rings over a polynomial ring and introduce an algorithm for computing them. There exist some algorithms for computing Gröbner bases in polynomial rings over a polynomial ring. However, we cannot obtain the reduced Gröbner bases by these algorithms. In this paper we propose a new notion of reduced Gröbner bases in polynomial rings over a polynomial r...
متن کاملComputing difference-differential dimension polynomials by relative Gröbner bases in difference-differential modules
In this paper we present a new algorithmic approach for computing the Hilbert function of a finitely generated difference-differential module equipped with the natural double filtration. The approach is based on a method of special Gröbner bases with respect to “generalized term orders” on Nm × Zn and on difference-differential modules. We define a special type of reduction for two generalized ...
متن کاملAn efficient method for computing comprehensive Gröbner bases
a r t i c l e i n f o a b s t r a c t A new approach is proposed for computing a comprehensive Gröb-ner basis of a parameterized polynomial system. The key new idea is not to simplify a polynomial under various specialization of its parameters, but rather keep track in the polynomial, of the power products whose coefficients vanish; this is achieved by partitioning the polynomial into two parts...
متن کاملTime Optimal Control Using Gröbner Bases
Abstract: The paper presents the solution of the time optimal control with the help of Gröbner Bases theory. First the set of polynomial equations for the triple integrator system with unknowns corresponding to the switching times is constructed and later it is solved in the computer algebra system Maple using the Groebner library. In dependence of resulting switching times the control action i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010